15 research outputs found
Swarm lexicographic goal programming for fuzzy open shop scheduling
In this work we consider a multiobjective open shop scheduling problem with uncertain processing times and flexible due dates, both modelled using fuzzy sets. We adopt a goal programming model based on lexicographic multiobjective optimisation of both makespan and due-date satisfaction and propose a particle swarm algorithm to solve the resulting problem. We present experimental results which show that this multiobjective approach achieves as good results as single-objective algorithms for the objective with the highest priority, while greatly improving on the second objectiv
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second se
An evolutionary approach to designing and solving fuzzy job-shop problems
First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spai
Initialization in genetic algorithms for constraint satisfaction problems
6th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2001 Granada, Spai
Scheduling with memetic algorithms over the spaces of semi-active and active schedules
8th International Conference, Zakopane, Polan